Uncertainty quantifications of Pareto optima in multiobjective problems

نویسندگان

  • Tzu-Chieh Hung
  • Kuei-Yuan Chan
چکیده

Design is a multi-objective decision-making process considering manufacturing, cost, aesthetics, usability among many other product attributes. The set of optimal solutions, the Pareto set, indicates the tradeoffs between objectives. Decision-makers generally select their own optima from the Pareto set based on personal preferences or other judgements. However, uncertainties from manufacturing processes and from operating conditions will change the performances of the Pareto optima. Evaluating the impacts of uncertainties on Pareto optima requires a large amount of data and resources. Comparing multiple Pareto solutions under uncertainty are also very costly. In this work, local Pareto set approximation is integrated with uncertainty propagation technique to quantify design variations in the objective space. An optimality influence range is proposed using linear combinations of objective functions that creates a more accurate polygon object variation subspace. A set of ‘virtual samples’ is then generated to form two quantifications of the objective variation subspace, namely an influence noise indicates how the design maintain Pareto, and an influence range that quantifies the overall variations of a design. In most engineering practices, a Pareto optimum with a smaller influence noise and a smaller influence area is preferred. We also extend the influence noise/range concept to nonlinear Pareto set with the second-order approximations. The quadratic local Pareto approximation method in the literature is also extended in this work to solve multi-objective engineering problems with black-box functions. The usefulness of the proposed quantification method is demonstrated using numerical examples as well as using engineering problems in structural design.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bounds for the Average and Smoothed Number of Pareto Optima

Smoothed analysis of multiobjective 0–1 linear optimization has drawn considerable attention recently. In this literature, the number of Pareto-optimal solutions (i.e., solutions with the property that no other solution is at least as good in all the coordinates and better in at least one) for multiobjective optimization problems is the central object of study. In this paper, we prove several l...

متن کامل

Pareto Local Optima of Multiobjective NK-Landscapes with Correlated Objectives

In this paper, we conduct a fitness landscape analysis for multiobjective combinatorial optimization, based on the local optima of multiobjective NK-landscapes with objective correlation. In singleobjective optimization, it has become clear that local optima have a strong impact on the performance of metaheuristics. Here, we propose an extension to the multiobjective case, based on the Pareto d...

متن کامل

Bidirectional Preference-based Search for Multiobjective State Space Graph Problems

In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. These cost vectors can be partially or completely ordered using a preference relation compatible with Pareto dominance. In this context, multiobjective preference-based search (MOPBS) aims at computing the preferred feasible solutions according to a predefined preference model, these preferred soluti...

متن کامل

Global search perspectives for multiobjective optimization

Extending the notion of global search to multiobjective optimization is far than straightforward, mainly for the reason that one almost always has to deal with infinite Pareto optima and correspondingly infinite optimal values. Adopting Stephen Smale’s global analysis framework, we highlight the geometrical features of the set of Pareto optima and we are led to consistent notions of global conv...

متن کامل

Bidirectional Preference-Based Search for State Space Graph Problems

In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. These cost vectors can be partially or completely ordered using a preference relation compatible with Pareto dominance. In this context, multiobjective preference-based search (MOPBS) aims at computing the preferred feasible solutions according to a predefined preference model, these preferred soluti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Intelligent Manufacturing

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2013